Data Structures

Introduction to Data Structures

Linked List (CONCEPT)

Linked List(Implementation in C++) | PART-1

Linked List(Implementation in C++) | PART-2

Doubly Linked List(CONCEPT) | PART-1

Doubly Linked List(Implementation in C++) | PART-2

Circular Linked List(CONCEPT)

Circular Linked List(Implementation in C++) | PART-1

Circular Linked List(REVISION) | PART-3

Stacks

Stacks(Array Implementation) | PART-1

Stacks(Linked List Implementation) | PART-2

Queues(CONCEPT)

Queues(Array Implementation) | PART-1

Queues(Linked List Implementation) | PART-2

Binary Trees

Binary Trees(Implementation)

Binary Search Tree (Concept & Analysis) | PART-1

Red Black Tree | PART #1

INSERTION in Red Black Tree

AVL Tree | PART-1

Hash Tables

Heap Data Structure | PART-1

Heap Sort | Part-2

Separate Chaining in Hash Table